Collective navigation of complex networks: Participatory greedy routing
نویسندگان
چکیده
منابع مشابه
a new greedy geographical routing in wireless sensor networks
wireless sensor network includes a large number of nodes which are distributed in a geographical location. the essential fact about wsn is that energy of nodes is limited. therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. in this paper we propose a method which performs routing in wsns using greedy approach. it is able to choose optimu...
متن کاملGreedy routing on networks of mobile agents
In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent i is delivered to the agent j whose distance from the destination is shortest among searched neighbors of agent i. Based on the greedy routing, we study the traffic dynamics and traffic-driven epidemic spreading on networks of mobile agents. We find that the...
متن کاملCollective Intelligence and Priority Routing in Networks
This paper describes how biologically-inspired agents can be used to solve complex routing problems incorporating prioritized information flow. These agents, inspired by the foraging behavior of ants, exhibit the desirable characteristics of simplicity of action and interaction. The collection of agents, or swarm system, deals only with local knowledge and exhibits a form of distributed control...
متن کاملDelivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
In this paper, we investigate how to design greedy routing to guarantee packet delivery in a three-dimensional (3D) network. In 2D networks, many position-based routing protocols apply face routing on planar routing structure as a backup method to guarantee packet delivery when greedy routing fails at local minimum. However, in 3D networks, no planar topology can be constructed anymore. Even wo...
متن کاملOptimal navigation in complex networks.
Recent literature has presented evidence that the study of navigation in complex networks is useful to understand their dynamics and topology. Two main approaches are usually considered: navigation of random walkers and navigation of directed walkers. Unlike these approaches ours supposes that a traveler walks optimally in order to minimize the cost of the walking. If this happens, two extreme ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2017
ISSN: 2045-2322
DOI: 10.1038/s41598-017-02910-x